class Solution(object):
    def isMatch(self, s, p):
        """
        :type s: str
        :type p: str
        :rtype: bool
        """
        def match(i,j):
            if i == 0:
                return False
            elif p[j-1] == ".":
                return True
            else:
                return s[i-1] == p[j-1]

        m , n = len(s) , len(p)    
        dp = [[False] * (n + 1) for _ in range(m + 1)]
        dp[0][0] = True
        for i in range(m+1):
            for j in range(1,n+1):
                if p[j-1] == "*":
                    dp[i][j] = dp[i][j-2]
                    if match(i,j-1):
                        dp[i][j] |= dp[i-1][j]
                else:
                    if match(i,j):
                        dp[i][j] = dp[i-1][j-1]
        return dp[m][n]

                    


            
